The 0/1 Knapsack Problem¶. As a first example, consider the solution of the 0/1 knapsack problem: given a set I. of items, each one with a weight wi. and estimated profit pi. , one wants to select a subset with maximum profit such that the summation of the weights of the selected items is less or equal to...